Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improved feature points matching algorithm based on speed-up robust feature and oriented fast and rotated brief
BAI Xuebing, CHE Jin, MU Xiaokai, ZHANG Ying
Journal of Computer Applications    2016, 36 (7): 1923-1926.   DOI: 10.11772/j.issn.1001-9081.2016.07.1923
Abstract752)      PDF (626KB)(397)       Save
Focusing on the issue that the Oriented fast and Rotated Brief (ORB) algorithm does not have scale invariance, an improved algorithm based on Speed-Up Robust Feature (SURF) and ORB was proposed. First, the feature points were detected by Hessian matrix, which made the extracted feature points have scale invariance. Second, the feature descriptors were generated by the ORB. Then the K-nearest neighbor algorithm was used for rough matching. Finally, the ratio test, symmetry test, the Least Median Squares (LMedS) theorem was used for purification. When the scale changed, the proposed algorithm's matching precision was improved by 74.3 percentage points than the ORB and matching precision was improved by 4.8 percentage points than the SURF. When the rotation changed, the proposed algorithm's matching precision was improved by 6.6 percentage points than the ORB. The proposed algorithm's matching time was above the SURF, below the ORB. The experimental results show that the improved algorithm not only keeps the rotation invariance of ORB, but also has the scale invariance, and the matching accuracy is improved greatly without decreasing the speed.
Reference | Related Articles | Metrics